#-*- encoding:utf-8 -*-
import math

'''
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

You may assume that the array is non-empty and the majority element always exist in the array.
1 整数数组，快速排序，遍历找出出现次数最多，尤其该题特殊是找出出现次数>⌊ n/2 ⌋，则一定是排序后的中间值
2 hash，查找哈希表中出现最多的元素 但当整数特别大时就很耗空间
'''
class Solution(object):
	def majorityElement(self, nums):
		sort(nums)

	def sort(self,nums,low,high):
		flag = nums[low]
		while(low<high):
			if(nums[high]>=flag) 
		


